Towards Robust Admission Control in Delay-Constrained Routing Problems

Delay-constrained routing problems: Accurate scheduling models and admission control

It has been recently shown [7] that the problem of routing a new packet flow in a computer network subject to a constraint on the worst-case end-to-end delay of its packets can be formulated as a Mixed-Integer Second-Order Cone Program (MISOCP), and solved with general-purpose tools on instances of realistic size in time compatible with real-time use. However, that result was obtained for only ...

Optimized Delay Constrained QoS Routing

QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find low-cost paths that satisfy given QoS constraints. The problem of finding least-cost routing is known to be NP-hard or complete and some algorithms have been proposed to find a near optim...

Delay-Robust Stochastic Routing In Timetable Networks

A new approach for delay-constrained routing

Delay-constrained routing protocols are used to find paths subject to a delay constraint while efficiently using network resources. Many of the delay-constrained routing protocols that have been proposed in the literature give priority to cost minimization during the path computing process. With this approach, paths with end-to-end delays too close to the delay constraint are obtained. We belie...

Algorithms for delay constrained group multicast routing

Multicast routing allows network sources to use network resources efficiently by sending only a single copy of data to all group members. In the delay constrained group multicast routing problem (DCGMRP), every group member is also a source, and has an individual minimal delay and bandwidth requirement. The routing algorithm must, for each member of the group, construct a source-based routing t...